1 On Load Balancing in Erlang

نویسنده

  • Murat Alanyali
چکیده

1 Abstract This chapter summarizes our recent work on the dynamic resource allocation problem. The question of interest is the performance of simple allocation strategies which can be implemented on-line. The chapter fo-cuses on the least load routing policy. The analysis is based on uid limit equations and the theory of large deviations for Markov processes with discontinuous statistics.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Lapedo: Hybrid Skeletons for Programming Heterogeneous Multicore Machines in Erlang

We describe Lapedo, a novel library of hybrid parallel skeletons for programming heterogeneous multi-core/many-core CPU/GPU systems in Erlang. Lapedo’s hybrid skeletons comprise a mixture of CPU and GPU components, allowing skeletons to be flexibly and dynamically mapped to available resources. We also describe a model for deriving near-optimal division of work between CPUs and GPUs, ensuring l...

متن کامل

A Semi-Distributed Load Balancing Architecture and Algorithm for Heterogeneous Wireless Networks

At present, dissimilar wireless access networks including WLAN, UMTS and WiMAX coexist in the mobile computing environment. Resource management, load balancing, reliability and QoS are the most significant research issues on heterogeneous wireless networks. Considering the high speed features of third and fourth generation heterogeneous wireless networks, an efficient semi-distributed load bala...

متن کامل

On Load Balancing in Erlang Networks

The dynamic resource allocation problem arises in a variety of applications The generic resource allocation setting involves a number of locations containing resources The dynamic aspect of the problem is the arrivals of consumers each of which requires a certain amount of service from the resources and the control variable of the problem is the allocation policy which speci es at which locatio...

متن کامل

Online Distribution and Load Balancing Optimization Using the Robin Hood and Johnson Hybrid Algorithm

Proper planning of assembly lines is one of the production managers’ concerns at the tactical level so that it would be possible to use the machine capacity, reduce operating costs and deliver customer orders on time. The lack of an efficient method in balancing assembly line can create threatening problems for manufacturing organizations. The use of assembly line balancing methods cannot balan...

متن کامل

Adaptive Load Balancing of Cellular CDMA Systems Considering Non-uniform Traffic Distributions

In this paper, we investigate the load balancing problem by jointly considering sectorization and hybrid F/CDMA scheme in the scenario of non-uniform traffic distributions. The problem is formulated as a mathematical optimization model, and is solved by Lagrangean relaxation approach. The model objective is to minimize weighted blocking probability in terms of distribution diversity. To evaluat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996